Calculating with Procedure Calls

نویسنده

  • A. Bijlsma
چکیده

Although various proof rules for procedure calls in weakest precondition semantics have been proposed over the years [3, chapter 12] [4] [1], none of these is particularly suitable for calculational program construction. The problem is that they tend to yield a precondition that is tortuously expressed. For instance, let a procedure for finding the integer square root of a parameter y be specified, using a specification variable m , by the precondition

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Search Algorithm for Calculating Validated Reliability Bounds

The search algorithm presented allows the CDF of a dependent variable to be bounded with 100% confidence, and allows for a guaranteed evaluation of the error involved. These reliability bounds are often enough to make decisions, and require a minimal number of function calls. The procedure is not intrusive, i.e. it can be equally applied when the function is a complex computer model (black box)...

متن کامل

An Analytical Model for Calculating Bounds on Call Blocking Probabilities in LEO Satellite Networks

We present an analytical model for calculating upper and lower bounds for call-blocking probabilities in a LEO satellite network that carries voice calls. The method is especially useful for large systems where calculation of call-blocking probabilities are too expensive. Our method calculates upper and lower bounds very easily and produces fairly accurate results.

متن کامل

Fluid approximation of a call center model with redials and reconnects

In many call centers, callers may call multiple times. Some of the calls are reattempts after abandonments (redials), and some are re-attempts after connected calls (reconnects). The combination of redials and reconnects has not been considered when making staffing decisions, while ignoring them will inevitably lead to underor overestimation of call volumes, which results in improper and hence ...

متن کامل

Calculating Polynomial Runtime Properties

Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and calculating other properties of programs, including their runtime, maximum stack depth, and (relative) path time costs. In this paper we show how precise (not just big-O) polynomial bounds on such costs may be calcula...

متن کامل

Reliability Assessment of Power Generation Systems in Presence of Wind Farms Using Fuzzy Logic Method

A wind farm is a collection of wind turbines built in an area to provide electricity. Wind power is a renewable energy resource and an alternative to non-renewable fossil fuels. In this paper impact of wind farms in power system reliability is investigate and a new procedure for reliability assessment of wind farms in HL1 level is proposed. In proposed procedure, application of Fuzzy – Markov f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1993